Heavy-traffic asymptotics for stationary GI/G/1-type Markov chains
نویسندگان
چکیده
Asmussen (1987) proved a heavy-traffic limit theorem for the GI/G/1-type Markov chain. As a corollary, the theorem shows that in the heavy-traffic limit, the stationary distribution of the properly scaled level variable is geometric and independent of the phase variable. In this paper, the heavy-traffic asymptotics of the stationary distribution is proved under a weaker condition than Asmussen’s, by the characteristic function approach.
منابع مشابه
Subexponential Asymptotics of the Stationary Distributions of GI/G/1-Type Markov Chains
2 This paper considers the subexponential asymptotics of the stationary distributions of GI/G/1-type Markov chains in two cases: (i) the phase transition matrix in non-boundary levels is stochastic; and (ii) it is strictly substochastic. For the case (i), we present a weaker sufficient condition for the subexponential asymptotics than those given in the literature. As for the case (ii), the sub...
متن کاملLogarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کاملHeavy Tails in Multi-Server Queue
In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time W in the GI/GI/2 FCFS queue is studied. Under subexponential-type assumptions on the service time distribution, bounds and sharp asymptotics are given for the probability P{W > x}. We also get asymptotics for the distribution tail of a stationary two-dimensional workload vector and of a stationary qu...
متن کاملHeavy Tails in Multi-Server Queue1
In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time W in the GI/GI/2 FCFS queue is studied. Under subexponential-type assumptions on the service time distribution, bounds and sharp asymptotics are given for the probability P{W > x}. We also get asymptotics for the distribution tail of a stationary two-dimensional workload vector and of a stationary qu...
متن کاملDetermination of Explicit Solution for a General Class of Markov Processes
In this paper, we study both the GI=M=1 type and the M=G=1 type Markov chains with the special structure A 0 = !. We obtain explicit formulas for matrices R and G, which generalized earlier results on Markov chains of QBD type. In the case of GI=M=1 type, we show how to nd the maximal eigenvalue of R, and then that the computation of R is equivalent to that of x 2. In the case of M=G=1 type, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 40 شماره
صفحات -
تاریخ انتشار 2012